Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZeBBx/w5vqw
Repositorysid.inpe.br/banon/2002/11.06.12.28
Last Update2002:11.06.02.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/banon/2002/11.06.12.28.26
Metadata Last Update2022:06.14.00.12.10 (UTC) administrator
DOI10.1109/SIBGRA.2000.883919
Citation KeyFariasMitcSilvWyli:2000:TiReIr
TitleTime-critical rendering of irregular grids
Year2000
Access Date2024, May 04
Number of Files1
Size777 KiB
2. Context
Author1 Farias, Ricardo
2 Mitchell, Joseph S. B.
3 Silva, Cláudio T.
4 Wylie, Brian
EditorCarvalho, Paulo Cezar Pinto
Walter, Marcelo
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)
Conference LocationGramado, RS, Brazil
Date17-20 Oct. 2000
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Pages243-250
Book TitleProceedings
Tertiary TypeFull Paper
OrganizationSBC - Brazilian Computer Society
History (UTC)2008-07-17 14:10:50 :: administrator -> banon ::
2008-08-26 15:23:02 :: banon -> administrator ::
2009-08-13 20:36:59 :: administrator -> banon ::
2010-08-28 20:00:10 :: banon -> administrator ::
2022-06-14 00:12:10 :: administrator -> :: 2000
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsendering (computer graphics)
time-critical rendering
irregular grids
rendering techniques
image generation
irregular grid data sets
fastest algorithms
real time analysis
data sets
computer hardware
very large data set analysis
simplification
triangulation
optimizations
approximation methods
object space
time budget
hierarchical representations
frame rates
medium-sized data sets
rendering algorithms
image accuracy
AbstractMany papers have presented rendering techniques and simplification ideas with the objective of speeding up image generation for irregular grid data sets. For large data sets, however, even the current fastest algorithms are known to require seconds to generate each image, making real time analysis of such data sets very difficult, or even impossible, unless one has access to powerful and expensive computer hardware. In order to synthesize a system for handling very large data set analysis, we have assembled algorithms for rendering, simplification and triangulation, and added to them some optimizations. We have made some improvements on one of the best current algorithms for rendering irregular grids, and added to it some simple approximation methods in both image and object space, resulting in a system that achieves high frame rates, even on slow computers without any specific graphic hardware. The algorithm adapts itself to the time budget it has available for each image generation, using hierarchical representations of the mesh for faster delivery of images when transformations are imposed to the data. When given additional time, the algorithm generates finer images, obtaining the precise final image if given sufficient time. We were able to obtain frame rates of the order of 5 Hz for medium-sized data sets, which is about 20 times faster than previous rendering algorithms. With a trade-off between image accuracy and speed, similar frame rates can be achieved on different computers.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2000 > Time-critical rendering of...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Time-critical rendering of...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZeBBx/w5vqw
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/w5vqw
Target File243-250.pdf
User Groupadministrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46PN6AP
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/04.27.03.08 4
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
NotesThe conference was held in Gramado, RS, Brazil, from October 17 to 20.
Empty Fieldsaffiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label language lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close